Search results for "Degree of a polynomial"
showing 10 items of 13 documents
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
2018
This paper presents a novel Artificial Bee Colony (ABC) approach for supervised classification of remote sensing images. One proposes to apply an ABC algorithm to optimize the coefficients of the set of polynomial discriminant functions. We have experimented the proposed ABC-based classifier algorithm for a Landsat 7 ETM+ image database, evaluating the influence of the ABC model parameters on the classifier performances. Such ABC model parameters are: numbers of employed/onlooker/scout bees, number of epochs, and polynomial degree. One has compared the best ABC classifier Overall Accuracy (OA) with the performances obtained using a set of benchmark classifiers (NN, NP, RBF, and SVM). The re…
Non-periodic Polynomial Splines
2015
In this chapter, we outline the essentials of the splines theory. By themselves, they are of interest for signal processing research. We use the Zak transform to derive an integral representation of polynomial splines on uniform grids. The integral representation facilitated design of different generators of spline spaces and their duals. It provides explicit expressions for interpolating and smoothing splines of any order. In forthcoming chapters, the integral representation of splines will be used for the constructions of efficient subdivision schemes and so also for the design spline-based wavelets and wavelet frames.
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory
2007
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a low polynomial degree. Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5]. He constructed functions with polynomial degree M and number of variables Omega(M2). We improve such a separation to become exponenti…
On the consequences of the standard polynomial
1998
The purpose of this paper is to shed some light on the polynomial identities of low degree for the n × n matrix algebra over a field of characteristic 0.Our main result is that we have found all the consequences of degree n + 2 of the standard polynomial have calculated the S n+2-character of the T-ideal generated by this polynomial.
Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III
1980
In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…
Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n
2005
Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.
Standard polynomials are characterized by their degree and exponent
2011
Abstract By the Giambruno–Zaicev theorem (Giambruno and Zaicev, 1999) [5] , the exponent exp ( A ) of a p.i. algebra A exists, and is always an integer. In Berele and Regev (2001) [2] it was shown that the exponent exp ( St n ) of the standard polynomial St n of degree n is not smaller than the exponent of any polynomial of degree n. Here it is proved that exp ( St n ) is strictly larger than the exponent of any other polynomial of degree n which is not a multiple of St n .
Bayesian inference for the extremal dependence
2016
A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…
Three-Dimensional Reconstruction of the Bony Nasolacrimal Canal by Automated Segmentation of Computed Tomography Images.
2016
Objective To apply a fully automated method to quantify the 3D structure of the bony nasolacrimal canal (NLC) from CT scans whereby the size and main morphometric characteristics of the canal can be determined. Design Cross-sectional study. Subjects 36 eyes of 18 healthy individuals. Methods Using software designed to detect the boundaries of the NLC on CT images, 36 NLC reconstructions were prepared. These reconstructions were then used to calculate NLC volume. The NLC axis in each case was determined according to a polygonal model and to 2nd, 3rd and 4th degree polynomials. From these models, NLC sectional areas and length were determined. For each variable, descriptive statistics and nor…
Necessary and sufficient conditions for frequency entrainment of quasi-sinusoidal injection-synchonised oscillators
1986
A method is presented which permits the first-approximation exact analysis of the dynamical stability of fundamental-mode injectionsynchronized oscillators (FISO's) characterized by a quasi-sinusoidal quasi-static behavior. By combining small parameter and stroboscopic transformation techniques, the phase-lock stability investigation of an nth-order system is reduced to the simple Hurwitz test on an nth degree polynomial easily obtainable from steady state describing quantities. On this basis, equations for critical locking are also derived, which demonstrate the existence of a pair of limit curves (Locus and Boundary) already conjectured and looked for in the past, but only with partial su…